Adaptive equalizer

ABSTRACT

An adaptive equalizer capable of suppressing an increase in circuit scale and an increase in operation clock frequency. An adaptive equalizer ( 100 ) performs an adaptive equalization process on a time-region signal in a frequency region. A signal converter ( 200 ) has: a first wide-bit memory ( 201 ) capable of reading/writing a plurality of sample signals; a first register group ( 202 ) comprising a plurality of registers capable of accessing the first wide-bit memory ( 201 ); a butterfly computation unit group ( 204 ) comprising a plurality of butterfly computation units; and a first connection switching unit ( 203 ) for switching the state of connection between the plurality of registers and the plurality of butterfly computation units.

TECHNICAL FIELD

The present invention relates to an adaptive equalizer which performs adaptive equalization for a time-domain signal in a frequency domain.

BACKGROUND ART

In a wireless propagation channel, a multi-path wave is generated other than a main wave due to a reflective object and other objects. Accordingly, it is necessary for a receiving apparatus of a radio signal to eliminate the effect of the multi-path wave. The ATSC (Advanced Television Systems Committee) standard which is a standard for digital television broadcast in North America, South Korea, and other countries adopts single-carrier modulation. It is for this reason that receiving apparatuses in the ATSC standard is designed to use adaptive equalizers, unlike other broadcast standards such as OFDM (Orthogonal Frequency Division Multiplexing) adopting multi-carrier modulation.

Generally, in single-carrier modulation, adaptive equalization is performed in a time domain. However, in the adaptive equalization in the time domain, convolution operation is necessary for filtering and updating coefficients, and the circuit size increases as the tap count increases.

In response to the problem, there is a technique for performing the adaptive equalization on a time-domain signal in a frequency domain, instead of the time domain (for example, see PTL1, PTL2, and NPL1). According to the techniques disclosed in PTL1, PTL2, and NPL1 (hereafter referred to as “related art”), adaptive equalization is performed after converting a time-domain signal into a frequency-domain signal by the Fast Fourier Transform. Furthermore, according to the conventional technology, a signal in a frequency domain after the adaptive equalization is converted into a time-domain signal by the Inverse Fast Fourier Transform. In a reception apparatus using a single-carrier modulation signal according to the related art is capable of improving reception capacity while suppressing the increase in the circuit size.

CITATION LIST Patent Literature PTL1 Japanese Unexamined Patent Application Publication (Translation of PCT Application) No. 2004-503180 PTL2 Japanese Unexamined Patent Application Publication (Translation of PCT Application) No. 2004-530365 Non-Patent Literature NPL1 John J. Shynk, “Frequency-Domain and Multirate Adaptive Filtering”, IEEE SP MAGAZINE, January 1992, pp. 14-37 SUMMARY OF INVENTION Technical Problem

However, with the conventional technology, when a large number of taps are required, or when high-speed reception is necessary, there is a problem that an operational clock frequency necessary for an adaptive equalizer increases. With the conventional technology, when the operational clock frequency increases, there are problems that the power consumption of the adaptive equalizer increases, or the increased operational clock frequency causes a trouble when implementing the adaptive equalizer in the FPGA (Field Programmable Gate Array). Accordingly, in an adaptive equalizer which performs the adaptive equalization on a time-domain signal in the frequency domain, it is necessary to suppress the increase in the circuit size and the operational clock frequency as much as possible.

It is an object of the present invention to provide an adaptive equalizer that performs adaptive equalization on a time-domain signal in the frequency domain, capable of suppressing the increase in the circuit size and the operational clock frequency.

Solution to Problem

The adaptive equalizer according to the present invention is an adaptive equalizer that performs adaptive equalization on a time-domain signal in a frequency domain, comprising a signal conversion section that performs at least one of a fast Fourier transform and an inverse fast Fourier transform, wherein the signal conversion section including: a memory capable of reading and writing signals for 2M samples, where M is a natural number; 2M registers accessible to the memory; M butterfly operation sections; and a switching control section that switches a connection state between the 2M registers and the M butterfly operation sections.

Advantageous Effects of Invention

According to the present invention, in an adaptive equalizer that performs adaptive equalization on a time-domain signal in the frequency domain, the increase in the circuit size and the operational clock frequency can be suppressed.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a block diagram illustrating a configuration of an adaptive equalizer according to Embodiment 1 of the present invention;

FIG. 2 is a chart illustrating an example of timing of processing by each signal conversion section according to Embodiment 1 of the present invention;

FIG. 3 is a block diagram illustrating the first example of the configuration of the signal conversion section according Embodiment 1 of the present invention;

FIG. 4 is a block diagram illustrating the second example of the configuration of the signal conversion section according Embodiment 1 of the present invention;

FIG. 5 is a block diagram illustrating the third example of the configuration of the signal conversion section according Embodiment 1 of the present invention;

FIG. 6 is a block diagram illustrating the first example of the configuration of an adaptive equalizer according to Embodiment 2 of the present invention;

FIG. 7 is a block diagram illustrating an example of the configuration of a time-domain filter according to Embodiment 2 of the present invention;

FIG. 8 is a block diagram illustrating an example of the configuration of around a butterfly operating section according to Embodiment 2 of the present invention;

FIG. 9 is a block diagram illustrating the first example of the configuration around a register according to Embodiment 2 of the present invention;

FIG. 10 is a block diagram illustrating the second example of the configuration around a register according to Embodiment 2 of the present invention;

FIG. 11 is a block diagram illustrating the third example of the configuration around a register according to Embodiment 2 of the present invention;

FIG. 12 is a block diagram illustrating the second example of the configuration of an adaptive equalizer according to Embodiment 2 of the present invention;

FIG. 13 is a block diagram illustrating the first example of the configuration around a memory in an adaptive equalizer according to Embodiment 3 of the present invention;

FIG. 14 is a block diagram illustrating the second example of the configuration around a memory in the adaptive equalizer according to Embodiment 3 of the present invention;

FIG. 15 is a block diagram illustrating a configuration of an adaptive equalizer according to Embodiment 4 of the present invention;

FIG. 16 is a block diagram illustrating a configuration of a signal conversion section according to Embodiment 4 of the present invention;

FIG. 17 is a block diagram illustrating main components of the circuit configuration of adaptive equalizer using a single port memory;

FIG. 18 is a block diagram illustrating a configuration of an adaptive equalizer according to Embodiment 4 of the present invention;

FIG. 19 is a block diagram illustrating main components of a modification of an adaptive equalizer according to Embodiment 4 of the present invention;

FIG. 20 is a block diagram illustrating a configuration around a memory of an adaptive equalizer when a single port memory is used;

FIG. 21 is a block diagram illustrating a configuration around a memory of an adaptive equalizer according to Embodiment 4 of the present invention; and

FIG. 22 is a block diagram illustrating main components of a modification of an adaptive equalizer according to Embodiment 4 of the present invention.

DESCRIPTION OF EMBODIMENTS

Embodiments of the present invention will be described in detail with reference to the drawings as follows.

Embodiment 1

FIG. 1 is a block diagram illustrating a configuration of an adaptive equalizer according to Embodiment 1 of the present invention.

In FIG. 1, adaptive equalizer 100 includes accumulation section 101, inter-block concatenating section 102, first Fast Fourier Transform section (hereafter referred to as “FFT section”) 103, complex conjugation section 104, and first multiplier 105. Adaptive equalizer 100 also includes first Inverse Fast Fourier Transform section (hereafter referred to as “IFFT section”) 106, block extracting section 107, decision section 108, error extracting section 109, first zero padding section 110, and second FFT section 111. Adaptive equalizer 100 also includes second multiplier 112, second IFFT section 113, second zero padding section 114, third FFT section 115, third multiplier 116, first adder 117, and first delay section 118.

Accumulation section 101 receives input of time-domain signals, and sequentially accumulates the time-domain signals for a predetermined block size.

Inter-block concatenating section 102 concatenates the block accumulated in accumulation section 101 and a newest block, and outputs the concatenated block.

First FFT section 103 performs FFT (Fast Fourier Transform) on the output from inter-block connecting section 102, and outputs the signal obtained.

Complex conjugation section 104 outputs complex conjugation of first FFT section 103.

First multiplier 105 multiplies the output from first FFT section 103 and output from first delay section 118 to be described later (adaptive equalizer coefficient converted into a frequency domain), and outputs the signal obtained.

First IFFT section 106 performs the Inverse Fast Fourier Transform (IFFT) on the output from first multiplier 105, and outputs the signal obtained.

Block extracting section 107 extracts the newest signal-series block from the output of first IFFT section 106, and outputs the extracted block.

Decision section 108 outputs a decision result to the output from block extracting section 107.

Error extracting section 109 extracts an error from an ideal signal point, from the output of block extracting section 107 (that is, the output from first IFFT 106), based on the output from decision section 108, and outputs the extracted error.

First zero padding section 110 receives an input of an error received by error extracting section 109, sets a part in a series of errors other than the predetermined tap coefficient to zero, and outputs the obtained signal.

Second FFT section 111 performs FFT on the output from first zero padding section 110, and outputs the obtained signal.

Second multiplier 112 multiplies the output from complex conjugation section 104 (that is, the complex conjugation of output from first FFT section 103) and the output from second FFT section 111, and outputs the signal obtained.

Second IFFT section 113 performs IFFT on the result of the multiplication by second multiplier 112, and outputs the signal obtained.

Second zero padding section 114 pads zero to a part other than a predetermined tap coefficient, out of the output from second IFFT section 113, and outputs the signal obtained.

Third FFT section 115 performs FFT on the output from second zero padding section 114, and outputs the signal obtained.

Note that, in adaptive equalizer 100, second IFFT section 113, second zero padding section 114, third FFT section 115 are placed after second multiplier 112. With this, adaptive equalizer 100 according to Embodiment can remove the influence of FFT on a discontinuous signal. Stated differently, these sections are capable of purposefully converting the multiplication result of the error series and the input signal in the frequency domain into the time domain, and padding zero to a part invalid as a tap coefficient, and converting the result into a signal in the frequency domain again. With this, the operation result completely identical to a block update in the time domain can be obtained, allowing the high reception capacity to be maintained.

Third multiplier 116 multiplies the output from third FFT section 115 and a predetermined coefficient μ, and outputs the signal obtained.

First adder 117 adds the output from third multiplier 116 and the output from first delay section 118 in a later stage, and outputs the signal obtained.

First delay section 118 delays the output from first adder 117, and outputs the delayed signal to first multiplier 105 as an adaptive equalizer coefficient converted into the frequency domain.

Stated differently, first adder 117 and first delay section 118 function as an accumulation section that accumulates the output from third multiplier 116.

The part from complex conjugation section 104 and decision section 108 to first delay section 118 functions as first coefficient updating section 120 in adaptive equalizer 100.

By configuring adaptive equalizer 100 as illustrated in FIG. 1, adaptive equalizer 100 can perform adaptive equalization on a time-domain signal in the frequency domain, instead of the time domain.

When the reception signal is a signal for television broadcast, it is necessary to process the reception signal in real time. Stated differently, all of the operation performed by adaptive equalizer 100 must be completed within the time of a block size.

In adaptive equalizer 100, FFT/IFFT are performed by five sections, namely, first to third FFT sections 103, 111, and 115, and first and second IFFT sections 106 and 113. FFT/IFFT reduces the number of operations required by performing a part of the operation in parallel, and reduces the time necessary for the operation by adaptive equalizer 100. Accordingly, adaptive equalizer 100 may perform FFT/IFFT operations that can be performed in parallel execution in parallel.

In the following description, the system from inter block concatenating section 102 to first multiplier 105 through complex conjugation section 104 is referred to as the system A. The system from first multiplier 105 to second multiplier 112 in the system A through decision section 108 is referred to as the system B. Furthermore, as illustrated in FIG. 1, the operation by first FFT section 103 is referred to as process A-1, the operation by second FFT section 113 is referred to as process A-2, the operation by third FFT section 115 is referred to as process A-3, and the operation by first IFFT section 106 is referred to as A-4. Subsequently, the operation by second FFT section 111 is referred to as process B-1. First to third FFT sections 103, 111, and 115, and first and second IFFT sections 106 and 113 are collectively referred to as “signal conversion section” when necessary.

FIG. 2 is a chart illustrating an example of the process timing by each signal conversion section in adaptive equalizer 100.

Process A-1 and process B-1 are not dependent on each other. Adaptive equalizer 100 includes two systems for performing FFT/IFFT operations, and performs process A-1 and process B-1 in parallel, as illustrated in FIG. 2, for example. With this process, adaptive equalizer 100 can reduce the time necessary for performing FFT/IFFT for one operation.

However, process A-2 is dependent on the process data of process B-1, and thus process B-1 must be complete before process A-2 starts. Accordingly, with regard to the system A, it is necessary for adaptive equalizer 100 to complete processes A-1 to A-4 within the block, as illustrated in FIG. 2.

Stated differently, even if adaptive equalizer 100 increases the circuits to more than three systems due to limitation in the dependency of the signal processing data, the operation time necessary for FFT/IFFT per block size cannot be reduced to a time necessary for four operations.

If the number of received symbols collectively processed in the frequency domain (block size) is 416 symbols which are half the number of symbols in one segment defined by the ATSC standard, the operation time for the block size is approximately 38.65 μsec. Accordingly, in the ATSC standard, FFT/IFFT at 1024 points must be performed for five times (four times in the example above) in approximately 38.65 μsec. Even if the processing time other than FFT/IFFT is ignored, operation for one FFT/IFFT must be complete within 7.73 μsec (in the example above, 9.66 μsec).

If it is not necessary to update the coefficient based on the latest output from the equalizer, there will be no problem if the adaptive equalizer performs the process in pipeline and increases the processing delay. In an actual adaptive equalizer, however, the characteristics are significantly degraded without an update on the coefficient based on the latest output from the equalizer. Consequently, the coefficients do not converge due to active change in a wireless channel, making the reception impossible.

Conventionally, the processing cycle count in FFT/IFFT and the circuit size are inversely proportionate.

More specifically, for a broadcaster, it is usually preferable to maintain a broadcast area as wide as possible, and to transmit the signal at high output power so as to reduce the cost for infrastructure. Accordingly, the delay wave due to a distant reflective object arrives with a delay of a few hundred symbols or more. Accordingly, the tap count to be processed by an adaptive equalizer is few hundred taps or more.

Stated differently, in an expected adapted system, it is necessary to deal with a long-delay multi-propagation path longer than or equal to 40 μsec. Accordingly, it is considered that at least 500 taps are necessary. In FFT/IFFT, it is necessary to calculate a result equal to convolution operation of block size 416 and tap count 500. Accordingly, since 512<(416+500)<1024, at least 1024 points are necessary. Stated differently, it is necessary to complete FFT/IFFT operation at 1024 points in a ratio once per 416/5=83.2 symbols.

Note that, in the OFDM system, if 8192 points and a guard interval of 1/8 are expected, it is sufficient that 8192-point FFT may be performed once within 9216 samples, and thus the processing cycle count is not strictly limited.

In the case of 1024-point FFT, the complex numbers are multiplied for 5120 times. Accordingly, if FFT is implemented by a single port memory and a single butterfly operation circuit, signal transform section has to operate at an oversampling frequency of 5120/83.2=61.5 times.

Furthermore, in an adaptive equalizer, a plurality of butterfly operation circuits is arranged in parallel, and is combined with a multi-port memory. With this configuration, the cycle count may be reduced. However, as the number of port increases, the circuit size increases. In addition, a memory corresponding to the port count greater than 10 is not generally used, thereby leading to limitation in use. Although it is possible to replace the memory with a register, the change increases the circuit size.

Accordingly, in adaptive equalizer 100 according to Embodiment 1, the circuit is configured with a register that does not have limit on simultaneous access, achieving the active use of a single port memory. In general, a memory as a method for holding digital data of the same capacity may be implemented by an area for a fraction of that of a register. Stated differently, adaptive equalizer 100 in Embodiment 1 can suppress the increase in the circuit size by using the memory readable/writable a plurality of signal samples and a plurality of registers accessible to the memory.

FIG. 3 is a block diagram illustrating the first example of the configuration of the signal conversion section according to Embodiment 1. Note that, as described above, signal conversion section refers to first to third FFT sections 103, 111, and 115, and first and second IFFT sections 106 and 113, as illustrated in FIG. 1. Each operation stage performed by FFT/IFFT is simply referred to as “stage” hereafter.

Signal conversion section 200 includes first wide-bit memory 201, first register group 202, first connection switching section 203, butterfly operation section group 204, second connection switching section 205, second register group 206, and second wide-bit memory 207.

First wide-bit memory 201 and second wide-bit memory 207 are memories with a large word size, capable of reading/writing signals (data) for M samples (2M samples twice). The order of data held by first wide-bit memory 201 and second wide-bit memory 207 is identical to the order of the data read by regular FFT/IFFT operations. However, first wide-bit memory 201 and second wide-bit memory 207 store data for M samples collectively in one address.

First register group 202 is composed of 2M registers accessible to first wide-bit memories 201. First register group 202 accesses first wide-bit memory 201 twice. With this process, first register group 202 simultaneously accesses 2M samples in parallel.

First connection switching section 203 switches the connection state between first register group 202 and butterfly operation section group 204 (hereafter referred to as a “connection state on first register group 202 side”).

Butterfly operation section group 204 is composed of M butterfly operation sections, each of which performs butterfly operations.

Second connection switching section 205 switches the connection state between butterfly operation section group 204 and second register group 206 (hereafter referred to as “connection state on the side of second register group 206”).

Second register group 206 is composed of 2M registers accessible to second wide-bit memories 207. Second register group 206 accesses second wide-bit memory 207 twice. With this process, second register group 206 simultaneously accesses 2M samples in parallel.

Note that, an operational clock frequency necessary for memory access by first register group 202 and second register group 206 is twice the operational clock frequency of butterfly operation section group 204. It is necessary for first register group 202 and second register group 206 to access the memory for 2×(1024/M) times for completing one stage. Subsequently, it is necessary for first connection switching section 203 and second connection switching section 205 to appropriately control switching of connection state between each register and each butterfly operation section for each two memory accesses.

First connection switching section 203 and second connection switching section 205 switch roles of first wide-bit memory 201 and second wide-bit memory 207 between an output memory and an input memory. Stated differently, first connection switching section 203 and second connection switching section 205 switch the connection state on the side of first register group 202 and the connection state on the side of second register group 206 to an appropriate state. The appropriate state refers to a state in which signal input is provided to each butterfly operation section from an appropriate register, and signal output from each butterfly operation section is output from an appropriate register.

Subsequently, butterfly operation section group 204 sequentially performs operation on each stage according to the switching in the connection state.

To put it differently, in FIG. 3, the traveling direction of the signals changes vertically in every stage. Stated differently, when the operation for 10 stages is necessary, signals move toward right in the first stage in FIG. 3, and the signals move toward left in the second stage in FIG. 3. As described above, signal processing section 200 (FFT section/IFFT section) can prevent the increase in the circuit size by switching the traveling direction of the signals for each stage and uses the circuit repetitively.

Furthermore, signal transforming section (FFT section/IFFT section) 200 can avoid the use of multiport that increases the circuit size, and implements the reception process in real time at a low operational clock frequency.

Note that, signal conversion section 200 may use a 2-bank wide-bit memory.

FIG. 4 is a block diagram illustrating the second example of the configuration of signal conversion section 200.

As illustrated in FIG. 4, signal conversion section 200 includes wide-bit memories 201 a, 201 b and register groups 202 a and 202 b, instead of first wide-bit memory 201 and first register group 202 in FIG. 3. Signal conversion section 200 includes wide-bit memories 207 a and 207 b, and group of registers 206 a and 206 b, instead of second wide-bit memory 207 and second register group 206 in FIG. 3.

Wide-bit memories 201 a, 201 b, 207 a, and 207 b each store data for M samples in one address, and an address space is 1024/2M.

Register groups 202 a, 202 b, 206 a, and 206 b access wide-bit memories 201 a, 201 b, 207 a, and 207 b, respectively.

As described above, signal conversion section 200 is capable of reducing the number of memory access by configuring a two-bank wide-bit memory. Stated differently, the number of necessary memory access which was 2×(1024/M) in a one-bank configuration (see FIG. 3) is reduced to half. Accordingly, the operational clock frequency of the register group is determined to be identical to that of butterfly operation section, and can be set to half of the configuration illustrated in FIG. 3. Stated differently, in the operation for accessing the memory, while the clock frequency twice the clock frequency of the butterfly operation section is necessary in a one-bank configuration, the 1× clock frequency is sufficient for a two-bank configuration.

Note that, by adopting a dual port accessible to given two addresses at the same time to one-bank configuration, signal conversion section 200 only requires the 1× clock frequency while performing the process performed by the two-bank configuration. However, with the dual port configuration, the circuit size increases as the number of ports increases. In contrast, with the two-bank configuration, an address across banks cannot be accessed, and the increase in the circuit size to the one-bank configuration is negligible.

Stated differently, with the two-bank configuration illustrated in FIG. 4, signal conversion section 200 can achieve the real-time reception while avoiding the use of multiport which increases the circuit size at an even lower operational clock frequency.

Note that, it is necessary for each butterfly operation section to obtain an appropriate value for each stage, for a twiddle factor necessary for the butterfly operation. In FIG. 3 and FIG. 4, it is assumed that each butterfly operation section stores a twiddle factor. However, a twiddle factor memory storing twiddle factors for the stages may be provided outside of the butterfly operation section.

FIG. 5 is a block diagram illustrating the third example of the configuration of signal conversion section 200.

As illustrated in FIG. 5, signal conversion section 200 includes twiddle-factor wide-bit memory 208 and twiddle-factor register group 209, in addition to the configuration illustrated in FIG. 3. Note that, butterfly operation section group 204 illustrated in FIG. 5 does not hold a twiddle factor.

Twiddle-factor wide-bit memory 208 is a memory with a large word size, capable of reading/writing signals (data) for M twiddle factors. Twiddle-factor wide-bit memory 208 has addresses allocated to each stage, and stores twiddle factors for the stages in advance.

Twiddle-factor register group 209 is composed of M registers each accessible to twiddle-factor wide-bit memory 208. Stated differently, twiddle-factor register group 209 simultaneously accesses wide-bit memories for twiddle factor 208 such that M twiddle factors are set in parallel. Subsequently, twiddle-factor register group 209 reads M corresponding twiddle factors from wide-bit memories for twiddle factor 208 for each stage, and passes the twiddle factors to appropriate butterfly operation sections in butterfly operations section group 204.

With this configuration, signal conversion section 200 does not have to include a memory for holding the twiddle factor for each butterfly operation section, allowing further reduction of the circuit size.

As described above, adaptive equalizer 100 according to Embodiment 1 includes a memory having a large word size and signal conversion section 200 using a plurality of registers accessing the memory. With this configuration, adaptive equalizer 100 can suppress the increase in the circuit size and the increase in the operational clock frequency.

Since real-time processing is possible without requiring an operational clock frequency faster than necessary, consumption power can be reduced as well.

Note that, in regular FFT, it is necessary to rearrange signals into a bit-reverse relationship. Conventionally, the switching may be performed as the first process, or the last process, or the switching may be skillfully performed during the butterfly operation.

In the configuration of signal conversion section 200 according to Embodiment 1, in order to switch the signals into the bit-reverse relationship, the process may not be closed in samples collectively read, but switching with data read from another address will be necessary. Stated differently, in order to switch the signals into a bit-reverse relationship, it is necessary to add a register to temporarily holding the signals only for switching. This process increases the number of memory access, increasing the number of cycles.

In contrast, in an entire adaptive equalizer 100 according to Embodiment 1, a condition that the signal that has gone through FFT once always goes through IFFT is satisfied.

Accordingly, it is preferable that each signal conversion section 200 in adaptive equalizer 100 according to Embodiment 1 does not perform bit reverse on purpose.

Note that, adaptive equalizer 100 may be configured such that butterfly operation section groups 204 provided for each stage are connected in series. In this case, first connection switching section 203 and second connection switching section 205 are not necessary. However, there is a possibility of increase in the circuit size.

Embodiment 2

In Embodiment 2 of the present invention, a decision feedback filter by time domain processing (hereafter referred to as a “time-domain filter”) is provided, and a multiplier and a register in the signal conversion section are shared by a multiplier and a register in the time-domain filter.

FIG. 6 is a block diagram illustrating the first example of the configuration of an adaptive equalizer according to Embodiment 2, and corresponding to FIG. 1 in Embodiment 1. The components identical to those in FIG. 1 are assigned with the same reference numerals as in FIG. 1, and the description for these components will be omitted.

In FIG. 6, first coefficient updating section 120 a in adaptive equalizer 100 a includes time-domain filter 131 a and second adder 132 a, in addition to the configuration illustrated in FIG. 1.

Time-domain filter 131 a is a transversal filter, receives an output of decision section 108 and an output from error extracting section 109, and outputs a feedback signal in the time domain.

Second adder 132 a adds an output from block extracting section 107 and a feedback signal which is an output of time-domain filter 131 a, and outputs a signal obtained. Note that, decision section 108 and error extracting section 109 receive an output of second adder 132 a, instead of an output from block extracting section 107.

FIG. 7 is a block diagram illustrating an example of the configuration of time-domain filter 131 a.

In FIG. 7, time-domain filter 131 a includes filtering operation section 310 a and second coefficient updating section 320 a.

Filtering operation section 310 a includes N-tap coefficients, N multipliers 311 a; N registers 312 a, adder 313 a, and others. Tap coefficients (wb₀, wb₁, wb₂, wb₃, . . . , wb_(N-1)) in filtering operation section 310 a are coefficients calculated by second coefficient updating section 320 a.

Second coefficient updating section 320 a includes N multipliers 321 a, N step size coefficient (μ) multiplier 322 a, N adders 323 a, N registers 324 a, and others. Second coefficient updating section 320 a operates as an adaptive filter, and calculates tap coefficients in filtering operation section 310 a (wb₀, wb₁, wb₂, wb₃, . . . , wb_(N-1)).

Adaptive equalizer 100 a with the configuration described above can perform adaptive equalization in the time domain, further improving the reception performance.

In time-domain filter 131 a, signals are collectively input for each block size. Stated differently, the operation cannot be performed until the adaptive equalization on the frequency domain in the earlier stage is complete, since an input signal does not exist. In other words, the adaptive equalization in the frequency domain and the adaptive equalization in the time domain can be performed simultaneously in parallel.

Taking advantage of this feature, adaptive equalizer 100 a according to Embodiment 2 may use a part of a circuit used for the adaptive equalization in the frequency domain and the adaptive equalization in the time domain in common.

For example, adaptive equalizer 100 a may use multiplier (not illustrated in FIG. 3) in each butterfly operation section in signal conversion section 200 (see FIG. 3), multiplier 311 a in time-domain filter 131 a, and multiplier 321 a in common. Furthermore, adaptive equalizer 100 a may use first and second register groups 202 and 206 in signal conversion section 200 (see FIG. 3), and registers 312 a and 324 a in time-domain filter 131 a in common.

However, in order to use the circuits in common, the configuration for switching input/output of the circuit is necessary.

Next, the configuration for using the multiplier in each of the butterfly operation section in signal conversion section 200, and multipliers 311 a and 321 a in time-domain filter 131 a in common will be described.

FIG. 8 is a block diagram illustrating an example of the configuration around the butterfly operation section.

Butterfly operation section 410 a illustrated in FIG. 8 corresponds to each butterfly operation section in butterfly operation section group 204 in signal conversion section 200 illustrated in Embodiment 1 (see FIG. 3).

In FIG. 8, butterfly operation section 410 a includes two adders 411 a and 412 a, and a multiplier 413 a for multiplying a twiddle factor, provided at an output side of one of adders; adder 412 a. Subsequently, butterfly operation section 410 a further includes first switching section 414 a between adder 412 a and multiplier 413 a.

Furthermore, signal conversion section (not illustrated) includes second switching section 430 a between a twiddle factor register 420 a holding the twiddle factor and multiplier 413 a, and includes third switching section 440 a on the output side of multiplier 413 a. Signal conversion section further includes control section 450 a controlling the switching of the connection status of first to third switching sections 414 a, 430 a, and 440 a.

First switching section 414 a switches one of the inputs of multiplier 413 a between an output of adder 412 a and an output of operating section other than signal conversion section (hereafter referred to as “another operating section”).

Second switching section 430 a switches the other input of multiplier 413 a between the output of twiddle factor register 420 a and an output of another operating section.

Third switching section 440 a switches the output of multiplier 413 a between connection switching section of signal conversion section and another operating section.

When performing FFT/IFFT operations, control section 450 a controls first to third switching sections 414 a, 430 a, and 440 a so as to establish a regular connection for butterfly operation section 410 a. Stated differently, control section 450 a performs control such that multiplier 413 a in butterfly operation section 410 a is used for the FFT/IFFT operations.

In contrast, when FFT/IFFT operations are not performed, control section 450 a controls first to third switching sections 414 a, 430 a, and 440 a such that the connection is reversed from the regular connection. More specifically, control section 450 a controls first to third switching sections 414 a, 430 a, and 440 a such that multiplier 413 a in butterfly operation section 410 a functions as multipliers 311 a and 321 a of time-domain filter 131 a (see FIG. 7), for example.

The description for the configuration achieving the common-use of multiplier in each butterfly operation section in signal conversion section and multipliers 311 a and 321 a in time-domain filter 131 a is as described above.

The following is the description of a configuration for achieving the sharing of the first and second register groups 202 and 206 in signal conversion section, and register 312 a in filtering operation section 310 a in time-domain filter 131 a.

FIG. 9 is a block diagram illustrating the first example of the configuration around a register.

In FIG. 9, register group placement section 500 a includes register input side switching section group 510 a, register group 520 a, register output side switching section group 530 a, and control section 540 a. Register group 520 a corresponds to first and second register groups 202 and 206 in signal conversion section 200 described in Embodiment 1 (see FIG. 3).

In FIG. 9, register input side switching section group 510 a includes 2M register input side switching sections 511 a, provided on the input side of 2M registers 521 a in register group 520 a on one-to-one basis. Register output side switching section group 530 a includes 2M register output side switching sections 531 a, provided on the output side of the registers 521 a in the register group 520 on one-to-one basis.

One of register input side switching sections 511 a switches the input of corresponding register 521 a between signal conversion section 200 (see FIG. 3) and decision section 108 (see FIG. 6). Subsequently, another register input side switching section 511 a switches the input to the corresponding register 521 a between signal conversion section 200 (see FIG. 3) and an output from register 521 a next to the corresponding register 521 a.

Register output side switching section 531 a switches the output of the corresponding register 521 a between signal conversion section 200 (see FIG. 3) and an input side of register 521 a next to the corresponding register 521 a (input side of register input side switching section 511 a).

When performing FFT/IFFT operation, control section 540 a controls register input side switching section group 510 a and register output side switching section group 530 a so as to establish regular connection for register group 520 a. More specifically, control section 540 a uses register group 520 a for FFT/IFFT operation.

In contrast, when performing operation for time-domain filter 131 a, control section 540 a controls register input side switching section group 510 a and register output side switching section group 530 a such that the connection is reversed from the regular connection. More specifically, control section 540 a performs control such that registers 521 next to each other are connected and the entire register group 520 a functions as a shift register. Control section 540 a controls register input side switching section group 510 a and register output side switching section group 530 a such that register group 520 a functions as register 312 a in filtering operation section 310 a in time-domain filter 131 a (see FIG. 7).

The configuration for achieving the common use of the first and second register groups 202 and 206 in signal conversion section, and register 312 a in filtering operation section 310 a in time-domain filter 131 a is as described above.

The following is the description of a configuration for achieving the common use of the first and second register groups 202 and 206 in signal conversion section, and register 324 a in second coefficient updating section 320 a in time-domain filter 131 a.

FIG. 10 is a block diagram illustrating the second example of the configuration around a register, and corresponds to FIG. 9. The components identical to those in FIG. 9 are assigned with the same reference numerals as in FIG. 9, and the description for these components will be omitted.

In FIG. 10, each register input side switching section 511 a switches the input of corresponding register 521 a between signal conversion section 200 (see FIG. 3) and adder 323 a in second coefficient updating section 320 a in time-domain filter 131 a (see FIG. 7).

Register output side switching section 531 a switches an output of corresponding register 521 a between (i) signal conversion section 200 (see FIG. 3) and (ii) adder 323 a in second coefficient updating section 320 a and multiplier 311 a in filtering operation section 310 a (see FIG. 7).

When performing FFT/IFFT operation, control section 550 a controls register input side switching section group 510 a and register output side switching section group 530 a so as to establish the regular connection described above.

In contrast, when performing operation for time-domain filter 131 a, control section 550 a controls register input side switching section group 510 a and register output side switching section group 530 a such that the connection is reversed from the regular connection. Control section 550 a controls register input side switching section group 510 a and register output side switching section group 530 a such that register group 520 a functions as register 324 a in second coefficient updating section 320 a in time-domain filter 131 a (see FIG. 7).

The configuration for achieving the common use of the first and second register groups 202 and 206 in signal conversion section, and register 324 a in second filtering operation section 320 a in time-domain filter 131 a is as described above.

Note that it is necessary for register 324 a in second coefficient updating section 320 a to hold coefficient values in the past. Accordingly, as described in Embodiment 2, when using a register in the signal conversion section and register 324 a in second coefficient updating section 320 a in common, it is necessary to accumulate data in the register in a memory before the switching, and reads the data from the memory again after the switching.

In this case, as illustrated in FIG. 11, register input side switching section 511 a connects, to input side of corresponding register 521 a, an output side of a memory reading section in a coefficient value memory for holding a previous coefficient value (neither of them is illustrated) after switching. Register output side switching section 531 a connects the output side of corresponding register 521 a after switching to a memory writing section in the coefficient value memory (not illustrated). Control section 560 a performs the control in the same manner as control section 550 a described above. Control section 560 a also controls register input side switching section group 510 a and register output side switching section group 530 a such that the coefficient values are read from/written on the coefficient value memory when performing the operation for time-domain filter 131 a.

With the configuration described above, adaptive equalizer 100 a can improve the reception performance while suppressing the increase in the circuit size.

Note that, the frequency of feedback in the time domain (frequency of coefficient update for time-domain filter 131 a) may be once in each block size, in the same manner as the frequency of feedback in the frequency domain (frequency of coefficient update by first coefficient updating section 120 a in FIG. 6). In this case, second coefficient updating section 320 a in time-domain filter 131 a becomes not necessary.

FIG. 12 is a block diagram illustrating the second example of the configuration around adaptive equalizer 100 a, and corresponds to FIG. 6. The components identical to those in FIG. 6 are assigned with the same reference numerals as in FIG. 6, and the description for these components will be omitted.

Adaptive equalizer 100 a illustrated in FIG. 12 does not include second coefficient updating section 320 a illustrated in FIG. 7 in time-domain filter 131 a. As illustrated in FIG. 12, adaptive equalizer 100 a includes fourth FFT section 141 a, fourth multiplier 142 a, third IFFT section 143 a, fifth multiplier 144 a, third adder 145 a, and second delay section 146 a, instead of second coefficient updating section 320 a.

Fourth FFT section 141 a performs FFT (conversion to the frequency domain) on an output from decision section 108 (feedback signal after the decision), and outputs the signal obtained.

Fourth multiplier 142 a multiplies the output from second FFT section 111 and output from fourth FFT section 141 a, and outputs the signal obtained.

Third IFFT section 143 a performs IFFT on the output from fourth multiplier 142 a (error component from decision value), and outputs the signal obtained.

Fifth multiplier 144 a multiplies the output from third IFFT section 143 a and a step size for updating coefficient GO, and outputs the signal obtained.

Third adder 145 a adds the output from fifth multiplier 144 a and the output from second delay section 146 a in a later stage, and outputs the signal obtained.

Second delay section 146 a delays the output from third adder 145 a, and outputs, to time-domain filter 131 a, the delayed output as a coefficient for the adaptive equalizer converted into the time domain.

Stated differently, third adder 145 a and second delay section 146 a function as an accumulation section that accumulates the output from fifth multiplier 144 a.

With the configuration described above, adaptive equalizer 100 a can reduce the number of multiplier and the registers necessary for a transversal filter even when a number of coefficients must be held in the feedback section, thereby reducing the circuit size.

Embodiment 3

Embodiment 3 of the present invention is an example in which a wide-bit memory in the signal conversion section is used in common with a memory in another section.

In the case of OFDM demodulation section (multi-carrier demodulation section), only one FFT operation is necessary for performing basic demodulation, and there is no feedback system that requires the adaptive process. Accordingly, in the OFDM demodulation section, operations may be simultaneously performed in a plurality of circuits in pipeline, and real-time processing can be performed without using the configuration of the signal conversion section according to the present invention.

In contrast, when estimating a channel, the OFDM demodulation section requires a relatively complex memory access using a scattered pilot signal or others that is regularly positioned, for example. Stated differently, a memory with a large word size is essential for the OFDM demodulation section.

In addition, it is not necessary to perform the reception process by the OFDM demodulation section and the reception process by the ATSC demodulation section at the same time.

Accordingly, in a reception apparatus that includes a memory in the OFDM demodulation section, the increase in the circuit size in the entire apparatus by adding adaptive equalizer 100 by using the memory essential for the OFDM demodulation section and the memory in adaptive equalizer 100 in common.

The OFDM demodulation section is a method for converting a time-domain signal into a frequency-domain signal by FFT and equalizing the signal based on a channel estimation value. Accordingly, the configuration of the OFDM demodulation section is significantly different from the adaptive equalizer, and there is not much in common between the two sections. Accordingly, when implementing a circuit compliant to the ATSC and OFDM systems, a large area was necessary with the conventional technique, making the increase in the cost inevitable.

In this regard, a reception apparatus adapting adaptive equalizer 100 according to Embodiment 3 can further reduce the circuit size of a circuit compliant to both the ATSC and OFDM systems by sharing the memory.

However, in order to achieve the common use of the memory, it is necessary for the ATSC to collectively access a plurality of samples in the wide-bit memory, and for the OFDM to access each sample. In view of these points, the configuration that allows switching in the access method will be described.

FIG. 13 is a block diagram illustrating the first example of the configuration around a memory according to Embodiment 3.

As illustrated in FIG. 13, the adaptive equalizer according to Embodiment 3 (not illustrated) includes address conversion section 620 b, serial/parallel conversion section 630 b, parallel/serial conversion section 640 b, and ATSC/OFDM switching section 650 b. They are data input/output section for wide-bit memory 610 b.

Wide-bit memory 610 b corresponds to first wide-bit memory 201 and second wide-bit memory 207 described in Embodiment 1 (see FIG. 3). When receiving input of a signal specifying reading mode/writing mode, an address signal, and a data signal, wide-bit memory 610 b reads/writes data based on the signals.

In the ATSC mode for performing the operation for the ATSC, address conversion section 620 b inputs an address signal to wide-bit memory 610 b without conversion.

Furthermore, when in the OFDM mode for performing the operation for the OFDM, address conversion section 620 b shifts the address signal to the right by Log₂(M) bits, and inputs only the high-order bit to wide-bit memory 610 b. Subsequently, address conversion section 620 b inputs a bit cut off by the shift to the right to serial/parallel conversion section 630 b and parallel/serial conversion section 640 b. Stated differently, serial/parallel conversion section 630 b and parallel/serial conversion section 640 b specifies a location of the bit in data collectively held for M samples.

When in the ATSC mode, serial/parallel conversion section 630 b inputs the input data to wide-bit memory 610 b without conversion.

In addition, when in the OFDM mode, serial/parallel conversion section 630 b overwrites the input data on data at the location specified by address conversion section 620 b in wide-bit memory 610 b. Here, it is necessary to write back data at the other locations that are not specified. Accordingly, serial/parallel conversion section 630 b first reads the data at the specified address, and writes back only the data at the specified location in the data for M samples that have been read by overwriting the data with the input data.

When in the ATSC mode, parallel/serial conversion section 640 b outputs data for M samples output from wide-bit memory 610 b without conversion.

In addition, when in the OFDM mode, parallel/serial conversion section 640 b extracts the data at the location specified by address conversion section 620 b among data for M samples output from wide-bit memory 610 b, and uses the data as the output data.

ATSC/OFDM switching section 650 b switches the ATSC mode/OFDM mode on address conversion section 620 b, serial/parallel conversion section 630 b, and parallel/serial conversion section 640 b.

With the configuration, the adaptive equalizer can use the wide-bit memory in the ATSC system and the OFDM system in common. Stated differently, the adaptive equalizer according to Embodiment 3 can implement a small-sized demodulation section compliant to multi-mode by using a memory in the OFDM demodulation section for single-carrier demodulation such as the ATSC as well.

Note that, the configuration illustrated in FIG. 13 is a configuration compliant to random access and sequential access to wide-bit memory 610 b.

In contrast, when the memory access is limited to the sequential access, a configuration capable of reducing the frequency of serial/parallel conversion is possible, as illustrated in FIG. 14.

As illustrated in FIG. 14, the adaptive equalizer according to Embodiment 3 (not illustrated) further includes M counter 660 b as data input/output section in wide-bit memory 610 b.

In this configuration, address conversion section 620 b outputs a bit cutoff the by the shift to the right to M counter 660 b.

M counter 660 b start counting when the input bit (cutoff bit) is zero. Subsequently, M counter 660 b inputs a signal indicating the timing to serial/parallel conversion section 630 b and parallel/serial conversion section 640 b each time the counter value is M.

Serial/parallel conversion section 630 b parallelizes sequential input data, and writes the parallelized data to wide-bit memory 610 b, based on the signal input timing from M counter 660 b (that is, once for every M samples).

Parallel/serial conversion section 640 b accesses wide-bit memory 610 b and reads the data, based on the signal input timing from M counter 660 b in the same manner (that is, once for every M samples). Subsequently, parallel/serial conversion section 640 b sequentially outputs the data read for one sample as the output data.

With this configuration, the number of access on wide-bit memory 610 b can be suppressed, contributing to the reduction in the power consumption.

Note that, adaptive equalizer may have a configuration in combination with the configuration illustrated in FIG. 13 and the configuration illustrated in FIG. 14. Subsequently, the adaptive equalizer may further include a control section that switches the configuration of the data input/output section depending on whether the access on the wide-bit memory 610 b is random or sequential.

Embodiment 4

Embodiment 4 of the present invention is an example in which the number of lines connecting the memory and the logic and the memory and the memory is reduced.

As described above, in Embodiment 1, the number of FFT and IFFT operations that have to be performed for each block can be reduced by separating the operations into a plurality of systems and performing parallel operations (see FIG. 2). As a result, in Embodiment 1, conditions concerning acceptable processing time for FFT and IFFT are reduced.

In contrast, in order to implement parallel operation, it is necessary to prepare memory as many as the number of systems, in addition to logic circuits. As a result, the circuit size increases. Consequently, the complexity in the lines connecting the memory and the logic and the memory and the memory increases, increasing the area necessary for the lines. In particular, in the configuration illustrated in FIG. 12, significant increase in the complexity of the lines is observed. Accordingly, in the configuration illustrated in FIG. 12, achieving a desired operation speed might be difficult, in addition to the increase in the area. In addition, for example, since the absolute number of the lines is limited in the FPGA, there is a case that the lines cannot be arranged.

In Embodiment 4, the complication of the lines is reduced as much as possible. FIG. 15 is a block diagram illustrating configuration of adaptive equalizer 1500 according to Embodiment 4.

In FIG. 15, adaptive equalizer 1500 includes a second delay section 1501, in addition to the components in adaptive equalizer 100 in FIG. 1. Note that, in FIG. 15, the components identical to those in FIG. 1 are assigned with the same reference numerals, and description for these components is omitted.

The second delay section 1501 delays a signal input from first FFT section 103 for one block size and outputs the delayed signal to first multiplier 105.

In adaptive equalizer 1500 illustrated in FIG. 15, the output from first FFT section 103 is input to first multiplier 105 and complex conjugation section 104. The output from complex conjugation section 104 is input to second multiplier 112. In the operation by first multiplier 105, a reception signal and a filtering coefficient are multiplied. While first multiplier 105 is performed in the main series of the equalization, the operation by second multiplier 112 is performed for deriving update component of the filtering coefficient by multiplying the reception signal and the error.

Here, it is necessary to multiply the reception signal and the error of the timing causing the error in order to derive the update component of the filtering coefficient. Accordingly, taking in consideration of the delay in first delay section 118 for updating the coefficient (one block is necessary), it is necessary to provide second delay section 1501 in the stage after the first FFT section 103, such that the input signal is delayed for one block, as illustrated in FIG. 15.

FIG. 16 is a block diagram illustrating configuration of signal conversion section 1600 according to Embodiment 4.

Signal conversion section 1600 in FIG. 16 includes wide-bit simple dual port memory 1601 having an address space twice as much as first wide-bit memory 201 and second wide-bit memory 207, instead of first wide-bit memory 201 and second wide-bit memory 207 in signal conversion section 200 in FIG. 3. Note that, in FIG. 16, the components identical to those in FIG. 3 are assigned with the same reference numerals, and description for these components is omitted.

Wide-bit simple dual port memory 1601 can read (READ) and write (WRITE) signals for 2M samples on different addresses simultaneously. A general complete dual port memory can perform READ and READ, or WRITE and WRITE on different addresses simultaneously. In contrast, a simple dual port memory can only perform READ and WRITE simultaneously. However, the simple dual port memory is implemented in an area smaller than a general complete dual port memory.

FIG. 17 is a block diagram illustrating main components of the circuit configuration of adaptive equalizer 1700 using a single port memory. FIG. 17 illustrates a case in which a single port memory is used when the process is performed in parallel by two systems of FFT and IFFT, as illustrated in FIG. 2.

Adaptive equalizer 1700 when using a single port memory includes, as main components, decision section 108, error extracting section 109, first adder 117, first memory 1701, second memory 1702, third memory 1703, fourth memory 1704, fifth memory 1705, first selection section 1706, first data conversion section 1707, FFT/IFFT operation section 1708, second data conversion section 1709, switching section 1710, second selection section 1711, sixth memory 1712, seventh memory 1713, and FFT operation section 1714. Note that, in FIG. 17, the components identical to those in FIG. 15 are assigned with the same reference numerals, and description for these components is omitted.

First memory 1701 stores an operation result of each stage and the final operation result in the FFT or the IFFT.

Second memory 1702 stores an operation result of each stage and the final operation result in the FFT or the IFFT.

Third memory 1703 stores the result of FFT, IFFT, or multiplication.

Fourth memory 1704 stores a filtering coefficient.

Fifth memory 1705 stores a filtering coefficient.

First selection section 1706 selects first memory 1701, third memory 1703, or fifth memory 1705, and reads or writes data.

First data conversion section 1707 performs multiplication, complex conjugation, or other operations on the FFT result and time constant.

FFT/IFFT operation section 1708 performs FFT operation, IFFT operation, or multiplication.

Second data conversion section 1709 performs multiplication, complex conjugation, or other operations on the FFT result and time constant.

Switching section 1710 switches the output of an addition result input from first adder 117 between first selection section 1706 and second selection section 1711.

Second selection section 1711 selects second memory 1702 or fourth memory 1704, and reads or writes data.

Sixth memory 1712 stores the result of FFT or IFFT.

Seventh memory 1713 stores the result of FFT or IFFT.

FFT operation section 1714 performs the FFT operation.

The process corresponding to the process performed by inter-block concatenating section 102 (see FIG. 15) is implemented by writing an input signal on first memory 1701 in FIG. 17, and reads the input signal with desired timing. The FFT on the signals after inter-block concatenation is performed by FFT/IFFT operation section 1708. The operation by FFT/IFFT operation section 1708 corresponds to the operation performed by first FFT section 103. For example, when FFT on 1024 points is performed, the data is transferred between first memory 1701 and second memory 1702 for five times. Subsequently, the FFT result is stored in first memory 1701. Sixth memory 1712 or seventh memory 1713 stores the FFT result performed by FFT operation section 1714. The operation by FFT operation section 1714 corresponds to the operation performed by second FFT section 111. The operation performed by second multiplier 112 (see FIG. 15) corresponds to multiplication of complex conjugation of FFT result stored in sixth memory 1712 or seventh memory 1713 and FFT result stored in first memory 1701. The multiplication corresponding to the multiplication performed by second multiplier 112 is performed by FFT/IFFT operation section 1708. The multiplication result is stored in third memory 1703. Here, FFT/IFFT operation section 1708 use the multiplier in the butterfly operation section in common in multiplication other than the FFT and the IFFT. The complex conjugation is performed by complex conjugation section 104 in FIG. 15 illustrating the operational process functional relationship, and by data conversion section 1707 in FIG. 17 illustrating the operational circuit configuration. Note that, it is necessary to keep holding the data stored in first memory 1701 for the use in a subsequent process.

The process corresponding to the process performed by second zero padding section 114 is performed by second data conversion section 1709. FFT/IFFT operation section 1708 performs FFT on the multiplication result stored in third memory 1703. The multiplication result stored in third memory 1703 corresponds to the multiplication result by third FFT section 115. When performing FFT by third FFT section 115, the data is transferred between third memory 1703 and first memory 1701 for five times. Subsequently, the FFT result is overwritten on third memory 1703.

Second data conversion section 1709 multiplies the FFT result stored in third memory 1703 and an updated time constant μ. Here, simple process such as bit shift is sufficient for the operation performed by multiplying time constant μ in order to reduce the circuit size. Accordingly, the operation for multiplying the time constant μ is performed by second data conversion section 1709. The data to which time constant μ is multiplied is added with a past filtering coefficient. Here, the past filtering coefficient is stored in fourth memory 1704, for example. The data on which the time constant μ is multiplied is added with a filtering coefficient stored in fourth memory 1704 in first adder 117. The addition results are stored in fourth memory 1704 and the opposite fifth memory 1705 as filtering coefficients, with the switching by switching section 1710 for each block. The filtering coefficient stored in fifth memory 1705 is multiplied with the operation results stored in first memory 1701 (operation result by FFT/IFFT operation section 1708 that has been performed). Subsequently, the multiplication result is overwritten on third memory 1703.

The IFFT is performed on the multiplication result stored in third memory 1703. The IFFT operation corresponds to an operation performed by first IFFT section 106 (see FIG. 15). Furthermore, the IFFT operation is performed by replacing the setting for the FFT operation with the setting for the IFFT operation in FFT/IFFT operation section 1708. In order to effectively use the FFT operation section for the IFFT operation, the order for address control on the memory access may be reversed with the FFT. Along with the IFFT, that data is transferred between third memory 1703 and second memory 1702 for five times. The operation result by first IFFT section 103 is overwritten on third memory 1703, and is output as a result of equalization. The operation result at first IFFT 103 is output from third memory 1703 per symbol, for the decision by decision section 108 and the extraction by error extracting section 109. The extracted error is stored in sixth memory 1712 in the system in FFT operation section 1714. FFT operation section 1714 performs the operation by sending data between sixth memory 1712 and seventh memory 1713. The operation by FFT operation section 1714 corresponds to the operation performed by second FFT section 111. The results of the operation are stored in sixth memory 1712 or seventh memory 1713. The operation by FFT operation section 1714 can be performed in parallel with the same timing as the operation by FFT/IFFT operation section 1708 (the operation corresponding to the operation performed by first FFT 103), as illustrated in FIG. 2.

FIG. 18 is a block diagram illustrating main components of configuration of adaptive equalizer 1500 according to Embodiment 4. FIG. 18 illustrates a case in which wide-bit simple dual port memory 1601 illustrated in FIG. 16. Note that, FIG. 18 is for describing the circuit configuration for implementing adaptive equalizer 1500 according to Embodiment 4 (connection relationship between the memories, the operational circuits, and others).

Adaptive equalizer 1500 illustrated in FIG. 18 includes decision section 108, error extracting section 109, first adder 117, first memory 1801, data conversion section 1802, first selection section 1803, FFT/IFFT operation section 1804, second selection section 1805, S/P section 1806, second memory 1807, and FFT operation section 1808 as main components. Note that, in FIG. 18, the components identical to those in FIG. 15 are assigned with the same reference numerals, and description for these components is omitted.

First memory 1801 stores the result of FFT, IFFT, or filtering coefficient.

Data conversion section 1802 multiplies the FFT operation result and the time constant, or performs processing such as complex conjugation.

First selection section 1803 selects either the data input from data conversion section 1802 or data read by second memory 1807, and outputs the selected data to FFT/IFFT operation section 1804.

FFT/IFFT operation section 1804 performs FFT operation, IFFT operation, or multiplication.

Second selection section 1805 selects the FFT operation result input from FFT/IFFT operation section 1804 or the addition result input from first adder 117, and outputs the selected data to first memory 1801.

S/P section 1806 converts the data input from first selection section 1803 from serial data to parallel data, and outputs the converted data to first adder 117.

Second memory 1807 stores the result of FFT or IFFT.

FFT operation section 1808 performs the FFT operation or the IFFT operation.

By comparing FIG. 17 and FIG. 18, in the configuration of FIG. 18, the number of memories is reduced (an address space for one memory increases), reducing the concentration of the lines.

More specifically, in adaptive equalizer 1700 illustrated in FIG. 17, it is possible to read the result of FFT on the reception signal and the result of FFT on the filtering coefficient at the same time by allocating addresses such that the results are stored in separate memory banks. However, in adaptive equalizer 1700, the following problem arises by storing the result of FFT on the reception signal and the result of FFT on the filtering coefficient in separate memory banks Stated differently, in adaptive equalizer 1700, with regard to an extended address space in twiddle-factor memory, a copy of the FFT result of the filtering coefficient or output of the FFT result of the filtering coefficient is stored is connected to multiplier 413 a. Here, the output of the memory bank is connected to multiplication section 413 a through selection section 430 a. As described above, in adaptive equalizer 1700 illustrated in FIG. 17, the line region increases if memory-memory connection or memory-logic connection is established.

In contrast, in Embodiment 4, an address space of wide-bit simple dual port memory 1601 (see FIG. 16) is extended. Subsequently, in Embodiment 4, the update result obtained by performing the FFT on the filtering coefficient is stored in an address space in wide-bit simple dual port memory 1601 different from address spaces for the FFT operation and the IFFT operation. With this, in Embodiment 4, the only connection is with the same memory bank, preventing the increase in the line region.

Furthermore, in Embodiment 4, a signal for delaying the result of the operation by first FFT section 103 for one block is stored in an address space with a space extended more than twice the address space in wide-bit simple dual port memory 1601.

Furthermore, in Embodiment 4, wide-bit simple dual port memory 1601 is used assuming that a multiplier used for the butterfly operation in the FFT and the IFFT and first multiplier 105 are used in common.

FIG. 19 is a block diagram illustrating main components of adaptive equalizer 1500 according to Embodiment 4. In FIG. 19, wide-bit simple dual port memory 1601 a, 1601 b are used, and the number of memory accesses is reduced to half.

In the configuration in FIG. 19, twiddle-factor wide-bit memory 1902 and twiddle-factor register group 1903 are added. In addition, in the configuration in FIG. 19, wide-bit simple dual port memories 1601 a and 1601 b each having the address space twice the wide-bit memory are included instead of first wide-bit memory 201 and second wide-bit memory 207, in FIG. 5.

Note that, in FIG. 19, the components identical to those in FIG. 5 are assigned with the same reference numerals, and description for these components is omitted. Furthermore, the twiddle-factor wide-bit memory 1902 has the same configuration as twiddle-factor wide-bit memory 208, and twiddle-factor register group 1903 has the same configuration as twiddle-factor register group 209. Accordingly, the description for these components is omitted. Furthermore, wide-bit simple dual port memories 1601 a and 1601 b have the same configuration as wide-bit simple dual port memory 1601. Accordingly, the description for these components will be omitted.

The memory configuration for storing the data after FFT on the filtering coefficient and the data after FFT on the reception signal one block before extending the address space of wide-bit simple dual port memories 1601 a and 1601 b more than twice.

FIG. 20 is a block diagram illustrating a configuration around a memory of an adaptive equalizer when a single port memory is used.

As illustrated in FIG. 20, the adaptive equalizer using a single port memory includes third multiplier 116, first adder 117, FFT result single port memory 2001 in which the FFT result is accumulated, first switching section 2002, first single port memory 2003 for accumulating filtering coefficient, second single port memory 2004 for accumulating filtering coefficient, and second switching section 2005. Note that, in FIG. 20, the components identical to those in FIG. 15 are assigned with the same reference numerals, and description for these components is omitted.

FFT result single port memory 2001 corresponds to second wide-bit memory 207 in FIG. 3, for example. FFT result single port memory 2001 stores the input FFT result.

First switching section 2002 outputs the addition result input from first adder 117 to first single port memory 2003 or second single port memory 2004.

First single port memory 2003 stores the FFT result input from first switching section 2002.

Second single port memory 2004 stores the FFT result input from first switching section 2002.

Second switching section 2005 selects the FFT result stored in first single port memory 2003 and the FFT result stored in second single port memory 2004, and outputs the selected result to first adder 117.

FFT result single port memory 2001 corresponds to second wide-bit memory 207 in FIG. 3, for example. In FFT result single port memory 2001, the FFT result for updating the filtering coefficient is accumulated. The FFT result accumulated in FFT result single port memory 2001 is read when updating the coefficient. In third multiplier 116, the FFT result accumulated in FFT result single port memory 2001 is multiplied with an updated time constant μ. Subsequently, in first adder 117, output from first single port memory 2003 or second single port memory 2004 in which past FFT result on filtering coefficients are accumulated and the multiplication result by third multiplier 116 are added. The addition result is written on a memory bank opposite to the single port memory bank that is read, among first single port memory 2003 and second single port memory 2004.

The switching between first single port memory 2003 and second single port memory 2004 in first switching section 2002 and second switching section 2005 is performed per block. Since the single port memory cannot be read or written at the same time, it is necessary to wait for a writing clock cycle after a clock cycle for reading. Accordingly, the next address cannot be read during the wait. For this reason, in the case of single port memory, if there is only one memory bank, the necessary cycle count is twice. Accordingly, when there is a strict limit on the number of processing cycle, it is necessary to configure two memory banks, that is, first single port memory 2003 and second single port memory 2004. Stated differently, when configuring an adaptive equalizer using a single port memory, it is necessary to provide a plurality of memories, that is, first single port memory 2003 and second single port memory 2004 in order to save the number of update cycles of filtering coefficients.

FIG. 21 is a block diagram illustrating configuration of adaptive equalizer 1500 according to Embodiment 4.

In FIG. 21, adaptive equalizer 1500 includes third multiplier 116, first adder 117, FFT result single port memory 2101 that accumulates the FFT result, and wide-bit simple dual port memory 2102 for accumulating filtering coefficient as main components. Note that, in FIG. 21, the components identical to those in FIG. 15 are assigned with the same reference numerals, and description for these components is omitted.

FFT result single port memory 2101 stores the input FFT result.

Wide-bit simple dual port memory 2102 stores the addition result input from first adder 117.

As illustrated in Embodiment 4, when wide-bit simple dual port memory 1601 is used, one memory bank such as wide-bit simple dual port memory 2102 is necessary. However, in wide-bit simple dual port memory 2102, address space twice is necessary. Furthermore, in wide-bit simple dual port memory 2102, a case in which data is read from a higher address and written on a lower address and a case in which data is read from a lower address and written on a higher address are switched for one block.

In wide-bit simple dual port memory 2102, the FFT result for updating filtering coefficient which is an addition result by first adder 117 is stored. The FFT result stored in wide-bit simple dual port memory 2102 is read when updating a filtering coefficient. In third multiplier 116, the FFT result accumulated in FFT result single port memory 2101 is accumulated by an updated time constant μ. Subsequently, in first adder 117, the output from wide-bit simple dual port memory 2102 in which the FFT result from the past filtering coefficients is stored and the multiplication result by third multiplier 116 are added. The addition result is written on wide-bit simple dual port memory 2102.

In Embodiment 4, the address space of wide-bit simple dual port memory 1601 or address spaces of wide-bit simple dual port memories 1601 a and 1601 b are extended. With this, in Embodiment 4, the configuration illustrated in FIG. 21 is implemented. Accordingly, no new line for configuring the circuit with the single port memory is necessary. Furthermore, in the case of FIG. 19, the FFT result for updating the filtering coefficients are accumulated on the side of wide-bit simple dual port memory 1601 a, and the FT result of the past filtering coefficient can be accumulated on the side of wide-bit simple dual port memory 1601 b. As a result, in Embodiment 4, the accumulated FFT result and the update for filtering coefficient are read simultaneously, and the data can be written on wide-bit simple dual port memory 1601 b after performing operations such as addition. In addition, in Embodiment 4, the next address can be read from both wide-bit simple dual port memories 1601 a and 1601 b, and the number of cycles does not increase.

In Embodiment 4, all of the FFT result for updating filtering coefficients and the FFT result for filtering coefficient are not accumulated in one of wide-bit simple dual port memories. In Embodiment 4, the FFT result for updating the filtering coefficient and the FFT result for the past filtering coefficient are accumulated on two wide-bit simple dual port memories half and half. In order to store the total number of the FFT result, (1024/M)×2 address spaces are necessary. Accordingly, in reality, the FFT result for updating filtering coefficient and the FFT result of the past filtering coefficients are stored in two wide-bit simple dual port memories 1601 a and 1601 b.

In Embodiment 4, the higher address and the lower address in wide-bit simple dual port memory 101 a and wide-bit simple dual port memory 1601 b are arranged opposite to each other. With this, in Embodiment 4, filter coefficient update data and past filtering coefficient data can be read simultaneously.

For example, with regard to the FFT result of the past filtering result, the data corresponding to the higher address is stored in wide-bit simple dual port memory 1601 a. Furthermore, the data corresponding to the lower address of the FFT result of the past filtering coefficient is stored in wide-bit simple dual port memory 1601 b. In contrast, the data corresponding to the lower address side of the FFT result in filtering coefficient updating section is stored in wide-bit simple dual port memory 1601 a. Furthermore, the data corresponding to the higher address of the FFT result in the filtering coefficient updating section is stored in wide-bit simple dual port memory 1601 b. With this, when updating the filtering coefficient on the lower address side, the filtering coefficient to be updated can be read from wide-bit simple dual port memory 1601 a. At the same time, the past filtering coefficient can be read from wide-bit simple dual port memory 1601 b. In the same manner, the past filtering coefficient to be updated can be read from wide-bit simple dual port memory 1601 b on the higher address side as well. At the same time, the past filtering coefficient can be read from wide-bit simple dual port memory 1601 a.

FIG. 22 is a block diagram illustrating main components of circuit configuration of another variation of adaptive equalizer 1500 according to Embodiment 4. Note that, in FIG. 22, the components identical to those in FIG. 18 are assigned with the same reference numerals, and description for these components is omitted.

In FIG. 22, memories 1801 a and 1801 b have the same configuration as first memory 1801 except that the number of memory banks is twice the number of memory banks in first memory 1801. Data conversion sections 1802 a and 1802 b have the same configuration as data conversion section 1802. Selection sections 1803 a and 1803 b have the same configuration as first selection section 1803. Selection sections 1805 a and 1805 b have the same configuration as second selection section 1805. In FIG. 22, memories 1807 a and 1807 b have the same configuration as second memory 1807 except that the number of memory banks is twice the number of memory banks in second memory 1807. Accordingly, the configuration of these components is omitted.

The switching section 2201 switches the output of the addition result by first adder 117 between output to selection section 1805 a and output to selection section 1805 b.

Selection section 2202 selects either one of the data stored in memory 1801 a and the data stored in memory 1801 b, and outputs the data to decision section 108 and to outside.

In FIG. 22, the number of memory access is reduced to half using a simple dual port memory. The comparison between the configurations in FIG. 18 and FIG. 22 shows that despite the number of the memory banks being twice, the clock speed for the memory access may be the same as the clock speed necessary for the butterfly operation in the FFT operation, and thus the power consumption can be reduced.

As described above, in Embodiment 4, only one wide-bit simple dual port memory capable of reading and writing signals for 2M samples simultaneously can be provided. With this configuration, according to Embodiment 4, the increase in the number of lines for memory-logic connection and memory-memory connection can be reduced.

In addition, the aspect of sharing the circuit in the signal conversion section is not limited to the example in Embodiments described above. For example, the adaptive equalizer may share first to third multipliers and a multiplier in the time-domain filter.

The adaptive equalizer according to the present invention is an adaptive equalizer that performs adaptive equalization on a time-domain signal in a frequency domain, comprising a signal conversion section that performs at least one of a fast Fourier transform and an inverse fast Fourier transform, wherein the signal conversion section including: a memory capable of reading and writing signals for 2M samples, where M is a natural number; 2M registers accessible to the memory; M butterfly operation sections; and a switching control section that switches a connection state between the 2M registers and the M butterfly operation sections.

In the configuration described above, the adaptive equalizer according to the present invention, the signal conversion section includes two pairs of the memory and the 2M registers; and the switching control section switches a connection state (i) between the 2M registers in one of the two pairs and the M butterfly operation sections and (ii) between the 2M registers in the other of the two pairs and the M butterfly operation sections, such that a role of the memory is switched between a memory for output and a memory for input for each stage of the fast Fourier transform and the inverse fast Fourier transform.

In the configuration described above, the adaptive equalizer according to the present invention includes: a first signal conversion section as the signal conversion section that performs the fast Fourier transform; and a second signal conversion section as the signal conversion section that performs the inverse fast Fourier transform on a signal on which the fast Fourier transform is performed by the first signal conversion section, wherein: the first signal conversion section does not perform a bit-reversal permutation in the fast Fourier transform; and the second signal conversion section does not perform a bit-reversal permutation in the inverse fast Fourier transform.

In the configuration described above, the adaptive equalizer according to the present invention, the signal conversion section further includes: a twiddle-factor memory that stores twiddle factors in each stage of the fast Fourier transform and the inverse fast Fourier transform, and that is capable of reading signals for M samples; and M twiddle-factor registers that are accessible to the twiddle-factor memory, and that obtains the twiddle factors and passes the twiddle factors to the M butterfly operation sections.

In the configuration described above, the adaptive equalizer according to the present invention further includes: an accumulation section that receives input of a signal in the time domain and sequentially accumulates the signals for a predetermined block size; an inter-block concatenating section that concatenates a block accumulated last time and a newest block; a first fast Fourier transform section as the signal conversion section that performs the fast Fourier transform on output from the inter-block connecting section; a first multiplier that multiplies output from the first fast Fourier transform section and a coefficient for adaptive equalizer converted into the frequency domain; a first inverse fast Fourier transform section as the signal conversion section that performs the inverse fast Fourier transform on output from the first multiplier; a block extracting section that extracts a newest block of signal series from the output from the first inverse fast Fourier transform section; an error extracting section that extracts an error from output from the first inverse fast Fourier transform section to an ideal signal point; a first zero padding section that pads zero to a series of the error extracted, except for a part denoting desired tap coefficients; a second fast Fourier transform section as the signal conversion section that performs the fast Fourier transform on output from the first zero padding section; a second multiplier that multiplies complex conjugation of output from the first fast Fourier transform section and output from the second fast Fourier transform section; a second inverse fast Fourier transform section as the signal processing section that performs inverse fast Fourier transform on a multiplication result of the second multiplier; a second zero padding section that pads zero to output from the second inverse fast Fourier transform section, except for a part denoting desired tap coefficients; a third fast Fourier transform section as the signal processing section that performs the fast Fourier transform on output from the second zero padding section; a third multiplier that multiplies output from the third fast Fourier transform section and a predetermined coefficient; and an accumulation section that accumulates output from the third multiplier.

In the configuration described above, the adaptive equalizer according to the present invention further includes a time-domain filter section that performs decision-feedback equalization on output from the first inverse fast Fourier transform section, in which at least one of multipliers used for butterfly operation sections in the first to third fast Fourier transform sections and the first and second inverse fast Fourier transform sections is used in common with a multiplier for convolution operation by the time-domain filter section.

In the configuration described above, the adaptive equalizer according to the present invention, at least one of multipliers used for butterfly operation sections in the first to third fast Fourier transform sections and the first and second inverse fast Fourier transform sections is used in common with a multiplier for the first to third multipliers.

In the configuration described above, the adaptive equalizer according to the present invention further includes a time-domain filter section that performs decision-feedback equalization on output from the first inverse fast Fourier transform section, in which at least one of the registers in the first to third fast Fourier transform section and the first and second inverse fast Fourier transform section is used in common with a register in the time-domain filter section.

In the configuration described above, the adaptive equalizer according to the present invention is provided in a reception apparatus including a multi-carrier demodulation section; and the memory is used in common with a memory in the multi-carrier demodulation section.

In the configuration described above, the adaptive equalizer according to the present invention further includes: an input/output section that includes an address conversion section, a serial/parallel conversion section, and a parallel/serial conversion section, and controls input and output of signals to and from the memory; and a control section that switches configuration of the input/output section depending on whether a method for accessing the memory is random or sequential.

In the configuration described above, the adaptive equalizer according to the present invention, in a writing mode when the method for accessing the memory is random, the input/output section reads data for 2M samples from the memory before writing the data and overwrites the data only on a predetermined location of the memory.

In the adaptive equalizer according to the present invention having the configuration described above, the signal conversion section has the memory capable of simultaneously reading and writing the signals for 2M samples.

The disclosure of Japanese Patent Application No. 2011-227922, filed on Oct. 17, 2011, including the specification, drawings and abstract, is incorporated herein by reference in its entirety.

INDUSTRIAL APPLICABILITY

The present invention is effective as an adaptive equalizer that performs adaptive equalization on a time-domain signal in the frequency domain, which is capable of suppressing the increase in the circuit size and the operational clock frequency. In particular, the present invention is suitable for an adaptive equalizer for a reception apparatus compliant to multi-value VSB (Vestigial Sideband) modulation adapted to the ATSC and others. The present invention is also suitable for digital adaptive equalizers such as audio echo canceller, noise canceller and others that requires a number of taps, in addition to an adaptive equalizer for wireless transmission.

REFERENCE SIGNS LIST

-   100, 100 a Adaptive equalizer -   101 Accumulation section -   102 Inter-block concatenating section -   103 First FFT section -   104 Complex conjugation section -   105 First multiplier -   106 First IFFT section -   107 Block extracting section -   108 Decision section -   109 Error extracting section -   110 First zero padding section -   111 Second FFT section -   112 Second multiplier -   113 Second IFFT section -   114 Second zero padding section -   115 Third FFT section -   116 Third multiplier -   117 First adder -   118 First delay section -   120, 120 a First coefficient updating section -   131 a Time-domain filter -   132 a Second adder -   141 a Fourth FFT section -   142 a Fourth multiplier -   143 a Third IFFT section -   144 a Fifth multiplier -   145 a Third adder -   146 a Second delay section -   200 Signal conversion section -   201 First wide-bit memory -   201 a, 201 b, 207 a, 207 b Wide-bit memory -   202 First register group -   202 a, 202 b, 206 a, 206 b Register group -   203 First connection switching section -   204 Butterfly operation section group -   205 Second connection switching section -   206 Second register group -   207 Second wide-bit memory -   208 Twiddle-factor wide-bit memory -   209 Twiddle-factor register group -   310 a Filtering operation section -   311 a, 321 a, 413 a Multiplier -   312 a, 521 a Register -   313 a, 323 a, 411 a, 412 a Adder -   320 a Second coefficient updating section -   322 a Step-size coefficient multiplier -   324 a Register -   410 a Butterfly operation section -   414 a First switching section -   420 a Twiddle-factor register -   430 a Second switching section -   440 a Third switching section -   450 a, 540 a, 550 a, 560 a Control section -   500 a Register group placement section -   510 a Register input-side switching section group -   511 a Register input-side switching section -   520 a Register group -   530 a Register output-side switching section group -   531 a Register output-side switching section -   610 b Wide-bit memory -   620 b Address conversion section -   630 b Serial/parallel conversion section -   640 b Parallel/serial conversion section -   650 b ATSC/OFDM switching section -   660 b M-counter 

1. An adaptive equalizer that performs adaptive equalization on a time-domain signal in a frequency domain, comprising a signal conversion section that performs at least one of a fast Fourier transform and an inverse fast Fourier transform, wherein the signal conversion section includes: a memory capable of reading and writing signals for 2M samples, where M is a natural number; 2M registers accessible to the memory; M butterfly operation sections; and a switching control section that switches a connection state between the 2M registers and the M butterfly operation sections.
 2. The adaptive equalizer according to claim 1, wherein: the signal conversion section includes two pairs of the memory and the 2M registers; and the switching control section switches a connection state (i) between the 2M registers in one of the two pairs and the M butterfly operation sections and (ii) between the 2M registers in the other of the two pairs and the M butterfly operation sections, such that a role of the memory is switched between a memory for output and a memory for input for each stage of the fast Fourier transform and the inverse fast Fourier transform.
 3. The adaptive equalizer according to claim 2, further comprising: a first signal conversion section as the signal conversion section that performs the fast Fourier transform; and a second signal conversion section as the signal conversion section that performs the inverse fast Fourier transform on a signal on which the fast Fourier transform is performed by the first signal conversion section, wherein: the first signal conversion section does not perform a bit-reversal permutation in the fast Fourier transform; and the second signal conversion section does not perform a bit-reversal permutation in the inverse fast Fourier transform.
 4. The adaptive equalizer according to claim 1, wherein the signal conversion section further includes: a twiddle-factor memory that stores twiddle factors in each stage of the fast Fourier transform and the inverse fast Fourier transform, and that is capable of reading signals for M samples; and M twiddle-factor registers that are accessible to the twiddle-factor memory, and that obtains the twiddle factors and passes the twiddle factors to the M butterfly operation sections.
 5. The adaptive equalizer according to claim 1, further comprising: an accumulation section that receives input of a signal in the time domain and sequentially accumulates the signals for a predetermined block size; an inter-block concatenating section that concatenates a block accumulated last time and a newest block; a first fast Fourier transform section as the signal conversion section that performs the fast Fourier transform on output from the inter-block connecting section; a first multiplier that multiplies output from the first fast Fourier transform section and a coefficient for adaptive equalizer converted into the frequency domain; a first inverse fast Fourier transform section as the signal conversion section that performs the inverse fast Fourier transform on output from the first multiplier; a block extracting section that extracts a newest block of signal series from the output from the first inverse fast Fourier transform section; an error extracting section that extracts an error from output from the first inverse fast Fourier transform section to an ideal signal point; a first zero padding section that pads zero to a series of the error extracted, except for a part denoting desired tap coefficients; a second fast Fourier transform section as the signal conversion section that performs the fast Fourier transform on output from the first zero padding section; a second multiplier that multiplies complex conjugation of output from the first fast Fourier transform section and output from the second fast Fourier transform section; a second inverse fast Fourier transform section as the signal processing section that performs inverse fast Fourier transform on a multiplication result of the second multiplier; a second zero padding section that pads zero to output from the second inverse fast Fourier transform section, except for a part denoting desired tap coefficients; a third fast Fourier transform section as the signal processing section that performs the fast Fourier transform on output from the second zero padding section; a third multiplier that multiplies output from the third fast Fourier transform section and a predetermined coefficient; and an accumulation section that accumulates output from the third multiplier.
 6. The adaptive equalizer according to claim 5, further comprising a time-domain filter section that performs decision-feedback equalization on output from the first inverse fast Fourier transform section, wherein at least one of multipliers used for butterfly operation sections in the first to third fast Fourier transform sections and the first and second inverse fast Fourier transform sections is used in common with a multiplier for convolution operation by the time-domain filter section.
 7. The adaptive equalizer according to claim 5, wherein at least one of multipliers used for butterfly operation sections in the first to third fast Fourier transform sections and the first and second inverse fast Fourier transform sections is used in common with a multiplier for the first to third multipliers.
 8. The adaptive equalizer according to claim 5, further comprising a time-domain filter section that performs decision-feedback equalization on output from the first inverse fast Fourier transform section, wherein at least one of the registers in the first to third fast Fourier transform section and the first and second inverse fast Fourier transform section is used in common with a register in the time-domain filter section.
 9. The adaptive equalizer according to claim 1, wherein: the adaptive equalizer is provided in a reception apparatus including a multi-carrier demodulation section; and the memory is used in common with a memory in the multi-carrier demodulation section.
 10. The adaptive equalizer according to claim 9, further comprising: an input/output section that includes an address conversion section, a serial/parallel conversion section, and a parallel/serial conversion section, and controls input and output of signals to and from the memory; and a control section that switches configuration of the input/output section depending on whether a method for accessing the memory is random or sequential.
 11. The adaptive equalizer according to claim 9, wherein in a writing mode when the method for accessing the memory is random, the input/output section reads data for 2M samples from the memory before writing the data and overwrites the data only on a predetermined location of the memory.
 12. The adaptive equalizer according to claim 1, wherein the signal conversion section includes one of the memory that can simultaneously read and write the signals for 2M samples from and on different addresses. 